On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components
نویسندگان
چکیده
منابع مشابه
On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components
The subject of this paper is Modal μ-Calculus, an extension of Modal Logic with operators for least and greatest fixpoints of monotone functions on sets. This logic, introduced by Kozen in [17], is a powerful formalism capable of expressing inductive as well as coinductive concepts and beyond (e.g. safety, liveness, fairness, termination, etc.) and is widely used in the area of verification of ...
متن کاملFinding strongly connected components in distributed graphs
The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongl...
متن کاملALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملLectures on the modal μ-calculus
These notes give an introduction to the theory of the modal μ-calculus and other modal fixpoint logics. ∗Institute for Logic, Language and Computation, University of Amsterdam, Science Park 904, NL–1098XH Amsterdam. E-mail: [email protected].
متن کاملProbabilistic Modal μ-Calculus with Independent Product
The probabilistic modal μ-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS’s). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the interval [0, 1] representing the probability that the property expressed by the formula holds at the state. One semantics is denotational and the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.25.9